Similarity Matrix Based Session Clustering by Sequence Alignment Using Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Similarity Matrix Based Session Clustering by Sequence Alignment Using Dynamic Programming
With the rapid increasing popularity of the WWW, Websites are playing a crucial role to convey knowledge to the end users. Every request of Web site or a transaction on the server is stored in a file called server log file. Providing Web administrator with meaningful information about user access behavior (also called click stream data) has become a necessity to improve the quality of Web infor...
متن کاملDNA Sequence Alignment by Parallel Dynamic Programming
Of late Molecular biology is becoming increasingly dependent on computer science algorithms as research tools. The process of aligning DNA sequences is widely used in modern biological sciences. Genetics databases hold extremely large amount of raw data. The human genome alone has approximately 3 billion DNA base pairs. To search through all this data and to find meaningful relationships in it,...
متن کاملSequence Similarity and Dynamic Programming
Dynamic programming is a classic programming technique, applicable in a wide variety of domains, like stochastic systems analysis, operations research, combinatorics of discrete structures, flow problems, parsing with ambiguous grammars, or biosequence analysis. Yet, no methodology is available for designing such algorithms. The matrix recurrences that typically describe a dynamic programming a...
متن کاملA Dynamic Programming Approach To Document Clustering Based On Term Sequence Alignment
Document clustering is unsupervised machine learning technique that, when provided with a large document corpus, automatically sub-divides it into meaningful smaller sub-collections called clusters. Currently, document clustering algorithms use sequence of words (terms) to compactly represent documents and define a similarity function based on the sequences. We believe that the word sequence is...
متن کاملExtracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method
In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer and Information Science
سال: 2008
ISSN: 1913-8997,1913-8989
DOI: 10.5539/cis.v1n3p66